7.5 If we take the linear congruential algorithm with an additive component of 0: Xn+1 = (aXn) mod m then it can be shown that if m is prime, and if a given value of a produces the maximum period of m 1, then ak will also produce the maximum period, provided that k is less than m and that m 1 is not divisible byk. Demonstrate this by using X0= 1 and m = 31 and producing the sequences for a = 3, 3,2, 33, and 34. | |
| View Solution | |
| << Back | Next >> |